On preimage knots in $S\sp 3$
نویسندگان
چکیده
منابع مشابه
Practical (Second) Preimage Attacks on TCS_SHA-3
TCS SHA-3 is a family of four cryptographic hash functions that are covered by an US patent (US 2009/0262925). The digest sizes are 224, 256, 384 and 512 bits. The hash functions use bijective functions in place of the standard, compression functions. In this paper we describe first and second preimage attacks on the full hash functions. The second preimage attack requires negligible time and t...
متن کاملCosmetic surgeries on knots in S 3
Two Dehn surgeries on a knot are called purely cosmetic, if they yield manifolds that are homeomorphic as oriented manifolds. Suppose there exist purely cosmetic surgeries on a knot in S, we show that the two surgery slopes must be the opposite of each other. One ingredient of our proof is a Dehn surgery formula for correction terms in Heegaard Floer homology.
متن کاملDehn Surgery on Knots in 3-manifolds
It has been known for over 30 years that every closed connected orientable 3manifold is obtained by surgery on a link in S [8]. However, a classification of such 3-manifolds in terms of this surgery construction has remained elusive. This is due primarily to the lack of uniqueness of the surgery description. In [5], Kirby gave us a calculus of surgery diagrams. However, the lack of a ‘canonical...
متن کاملPreimage Attacks on 3-Pass HAVAL and Step-Reduced MD5
This paper presents preimage attacks on the hash functions 3-pass HAVAL and step-reduced MD5. Introduced in 1992 and 1991 respectively, these functions underwent severe collision attacks, but no preimage attack. We describe two preimage attacks on the compression function of 3-pass HAVAL. The attacks have a complexity of about 2 compression function evaluations instead of 2. We present several ...
متن کاملPreimage Attacks on 3, 4, and 5-Pass HAVAL
This paper proposes preimage attacks on hash function HAVAL whose output length is 256 bits. This paper has three main contributions; a preimage attack on 3-pass HAVAL at the complexity of 2, a preimage attack on 4-pass HAVAL at the complexity of 2, and a preimage attack on 5-pass HAVAL reduced to 151 steps at the complexity of 2. Moreover, we optimize the computational order for brute-force at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1987
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1987-0891169-7